Software Patterns for Traceability of Requirements to Finite State Machine Behavior

نویسندگان

  • Parastoo Delgoshaei
  • Mark Austin
چکیده

This paper describes a software design pattern (e.g., hierarchical graphs of modelview-controllers) and models of visualization for ontology-enabled traceability, where requirements are traced to elements of finite-state machine behavior (e.g., actions, states, transitions and guard conditions). These ontology-enabled traceability mechanisms will play an important role in the team-based development of network-enabled platforms for analysis, design, and early validation and verification of information-age engineering systems. The application of these concepts is illustrated through the study of a simplified rail transit system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Domain-Specific Language for Traceability in Modeling

i Abstract Requirements are a key aspect of software development. Requirements are also related with other software artefacts including designs, test cases and documentation. These artefacts are often captured with specialized models. However, many tools lack support for traceability relationships between requirements artefacts and model artefacts, leading to analysis issues. To establish trace...

متن کامل

Traceability Patterns: An Approach to Requirement-Component Traceability in Agile Software Development

Requirements traceability, regardless of the process used to produce a software system, is an important quality attribute for the resulting software product. However, existing approaches to achieving requirements traceability have been specifically designed for traditional software development with formal requirements processes. With the wide industry adoption of agile development methodologies...

متن کامل

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

Composition of Business Components Based on Behavior for Software Reuse

41 Abstract The capability to easily find useful components has become increasingly importance in software reuse field. Current researches on component retrieval are mostly limited to retrieve the component whose function is most close to the user requirement. However, in the process of component retrieval, we frequently face the problem that the individual component can’t completely meet user’...

متن کامل

Tabular Notations for State Machine-Based Specifications

T term reactive system describes a system that needs to continuously react to inputs coming from the environment. Finite state machines are a widely used concept for specifying the behavior of such systems. Since finite state machines allow the rigorous capture of functional aspects of system behavior, they offer several advantages over informal specifications. For example, they provide the abi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012